Stigmergic coverage algorithm for multi-robot systems (demonstration)

نویسندگان

  • Bijan Ranjbar Sahraei
  • Gerhard Weiss
  • Ali Nakisaee
چکیده

We demonstrate the realization of stigmergic coverage for multi-robot systems. Compared to current state-of-the-art algorithms for multi-robot coverage, our Stigmergy-based Coverage algorithm (StiCo) has several key advantages. In particular, it does not need direct robot-robot communication. Moreover, this algorithm does not require any prior information about the environment. Simulation results illustrate robustness, scalability and simplicity of the algorithm.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A macroscopic model for multi-robot stigmergic coverage

This paper explores a multi-robot coverage approach called StiCo (for“Stigmergic Coverage”) by deriving a probabilistic macroscopic model. The proposed model makes it possible to quickly and efficiently study the swarm-type behavior of StiCo, and also allows for making predictions about its long term behavior. The model is validated in a twofold way: through computer simulations, and with real ...

متن کامل

A Multi-robot Coverage Approach Based on Stigmergic Communication

Recent years have witnessed a rapidly growing interest in using teams of mobile robots for autonomously covering environments. In this paper a novel approach for multi-robot coverage is described which is based on the principle of pheromone-based communication. According to this approach, called StiCo (for “Stigmergic Coverage”), the robots communicate indirectly via depositing/detecting marker...

متن کامل

Multi-robot task allocation through vacancy chain scheduling

Modeling the effects of robot interaction in multi-robot systems, i.e., the group dynamics, is difficult due to the complexity of such interactions. This article formalizes the concept of group dynamics in the framework of scheduling and presents a proof that multi-robot task allocation (MRTA), in systems with significant performance effects from group dynamics, is an N P-complete problem. As a...

متن کامل

Map-merging in Multi-robot Simultaneous Localization and Mapping Process Using Two Heterogeneous Ground Robots

In this article, a fast and reliable map-merging algorithm is proposed to produce a global two dimensional map of an indoor environment in a multi-robot simultaneous localization and mapping (SLAM) process. In SLAM process, to find its way in this environment, a robot should be able to determine its position relative to a map formed from its observations. To solve this complex problem, simultan...

متن کامل

Flexible Demonstration Learning System for Variable Number of Robots

In this paper, we present flexMLfD, a robot independent and task independent demonstration learning system that supports a variable number of robot learners. Our approach is based on the Confidence-Based Autonomy (CBA) demonstration learning algorithm, which provides the means for a single robot to learn a task policy through interaction with a human teacher. The generalized representation and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012